Symbolic two-dimensional minimization of strongly unspecified finite state machines
نویسندگان
چکیده
| A generalization of the classical state minimization problem for Finite State Machine (FSM) is proposed and discussed. In contrast to classical state minimization algorithms that minimize in one dimension (states), our algorithmminimizes the FSM in two dimensions: the numbers of both input symbols and internal state symbols are minimized in an iterative sequence of input minimization and state minimization procedures. This approach leads to an input decomposition of the FSM. A modi ed formulation of the state minimization problem is also introduced, and an eÆcient branch-and-bound program, FMINI, is presented. FMINI produces an exact minimum result for each component minimization process and a globally quasi-minimum solution to the entire twodimensional FSM minimization problem. For some benchmarks, especially those with a high percentage of don't cares, as those that occur in Machine Learning, this approach produces a more optimum results than those produced by the state minimization alone.
منابع مشابه
Symbolic cover minimization of fully I/O specified finite state machines
Symbolic cover minimization is an important step within a well-known state-assignment technique for finite state machines (FSM’s) 121. Currently, multiple-valued-input logic minimization techniques are used to find a minimum symbolic cover. The former problem, however, is computationally intractable, so heuristics are used. We show a simplified technique, based on an extension of the FSM minimi...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملConcurrent Two-Dimensional State Minimization and State Assignment of finite State Machines
A generalization of the classical state minimization of a Finite State Machine FSM is described The FSM is minimized here in two dimensions numbers of both input symbols and internal states are mini mized in an iterative sequence of input minimizatio and state minimization procedures For each machine in the sequence of FSMs created by the algorithm an equivalent FSM is found that attempts to mi...
متن کاملProbabilistic Analysis of Large Finite State
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veriication problems. Recently, we have shown how symbolic algorithms based on Algebraic Decision Diagrams may be used to calculate the steady-state probabilities of nite state machines with more than 10 8 states. These algorithms treated machines with sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Systems Architecture
دوره 47 شماره
صفحات -
تاریخ انتشار 2001